induced subgraph

См. также в других словарях:

• Induced subgraph isomorphism problem — In complexity theory and graph theory, induced subgraph isomorphism is an NP complete decision problem that involves finding a given graph as an induced subgraph of a larger graph.Formally, the problem takes as input two graphs G 1=( V 1, E 1)… …   Wikipedia

• Induced path — An induced path of length four in a cube. Finding the longest induced path in a hypercube is known as the snake in the box problem. In the mathematical area of graph theory, an induced path in an undirected graph G is a path that is an induced… …   Wikipedia

• Subgraph isomorphism problem — In complexity theory, Subgraph Isomorphism is a decision problem that is known to be NP complete. The formal description of the decision problem is as follows.Subgraph Isomorphism(G1, G2) Input: Two graphs G1 and G2. Question: Is G1 isomorphic to …   Wikipedia

• Maximum common subgraph isomorphism problem — In complexity theory, maximum common subgraph isomorphism (MCS) is an optimization problem that is known to be NP hard. The formal description of the problem is as follows: Maximum common subgraph isomorphism(G1, G2) Input: Two graphs G1 and G2.… …   Wikipedia

• Dense subgraph — An example of a graph G with density dG = 1.375 and it s densest subgraph induced by the vertices b,c,d and h in red with density 1.4 In computer science the notion of highly connect …   Wikipedia

• Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

• Rado graph — The Rado graph, as numbered by Rado (1964). In the mathematical field of graph theory, the Rado graph, also known as the random graph or the Erdős–Renyi graph, is the unique (up to isomorphism) countable graph R such that for any finite graph G… …   Wikipedia

• Perfect graph — The Paley graph of order 9, colored with three colors and showing a clique of three vertices. In this graph and each of its induced subgraphs the chromatic number equals the clique number, so it is a perfect graph. In graph theory, a perfect… …   Wikipedia

• Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and …   Wikipedia

• Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… …   Wikipedia

• Substructure — In universal algebra, an (induced) substructure or (induced) subalgebra is a structure whose domain is a subset of that of a bigger structure, and whose functions and relations are the traces of the functions and relations of the bigger structure …   Wikipedia